How fast can one arbitrarily and precisely scale images?
نویسندگان
چکیده
Image scaling is a frequent operation in video processing for optical metrology. In the paper, results of comparative study of computational complexity of different algorithms for scaling digital images with arbitrary scaling factors are presented and discussed. The following algorithms were compared: different types of spatial domain processing algorithms (linear, cubic, cubic spline interpolation) and a new DCT-based algorithm, which implements perfect (interpolation error free) scaling through discrete sinc-interpolation and is virtually free of boundary effects (characteristic for the DFT-based scaling algorithms). The comparison results enable evaluation of the feasibility of realtime implementation of the algorithms for arbitrary image scaling.
منابع مشابه
Evaluation of gray scale changes of CBCT system images in different axis using the DICOM file
The images of dental CBCT imaging systems used in conic shaped beams, stored in the DICOM format, have various applications in the dentistry, including bone density estimation to select the location of the orthodontic implant, bone loss detection and etc. In these systems, unlike CT imaging systems, the resulting images exhibit gray-scale non-uniformity in each of the different axis in FOV. Thi...
متن کاملOn the use of Textural Features and Neural Networks for Leaf Recognition
for recognizing various types of plants, so automatic image recognition algorithms can extract to classify plant species and apply these features. Fast and accurate recognition of plants can have a significant impact on biodiversity management and increasing the effectiveness of the studies in this regard. These automatic methods have involved the development of recognition techniques and digi...
متن کاملInverse Filters for Reconstruction of Arbitrarily Focused Images from two Differently Focused Images
This paper describes a novel ltering method to reconstruct an arbitrarily focused image from two dierently focused images. Based on the assumption that image scene has two layers { foreground and background {, two dierently fo-cused images are used as inputs, one of which is focused on the foreground and the other is focused on the background. The linear equation that holds between these images...
متن کاملCross-Frequency Coupling in Parieto-Frontal Oscillatory Networks During Motor Imagery Revealed by Magnetoencephalography
dependent reset partially resolves this issue. One might expect that the problem of spike timing is overcome completely when considering biophysically more detailed models, such as Hodgkin–Huxley or compartment models; but even for arbitrarily refined, high-dimensional differential equation models, any reasonable time scale described must be much larger than intrinsic time scales characterizing...
متن کاملA New Fast and Efficient HMM-Based Face Recognition System Using a 7-State HMM Along With SVD Coefficients
In this paper, a new Hidden Markov Model (HMM)-based face recognition system is proposed. As a novel point despite of five-state HMM used in pervious researches, we used 7-state HMM to cover more details. Indeed we add two new face regions, eyebrows and chin, to the model. As another novel point, we used a small number of quantized Singular Values Decomposition (SVD) coefficients as feature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013